Graph-Sparse Logistic Regression

نویسندگان

  • Alexander LeNail
  • Ludwig Schmidt
  • Johnathan Li
  • Tobias Ehrenberger
  • Karen Sachs
  • Stefanie Jegelka
  • Ernest Fraenkel
چکیده

We introduce Graph-Sparse Logistic Regression, a new algorithm for classification for the case in which the support should be sparse but connected on a graph. We validate this algorithm against synthetic data and benchmark it against L1-regularized Logistic Regression. We then explore our technique in the bioinformatics context of proteomics data on the interactome graph. We make all our experimental code public and provide GSLR as an open source package.1

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logistic regression for graph classification

In this paper we deal with graph classification. We propose a new algorithm for performing sparse logistic regression on graphs. Sparsity is required for the reason of interpretability, which is often necessary in domains such as bioinformatics or chemoinformatics. Our method is comparable in accuracy with other methods of graph classification and produces probabilistic output in addition.

متن کامل

Hyperspectral Image Segmentation with Discriminative Class Learning

This paper presents a Bayesian approach to hyperspectral image segmentation that boosts the performance of the discriminative classifiers. This is achieved by combining class densities based on discriminative classifiers with a Multi-Level Logistic Markov-Gibs prior. This density favors neighboring labels of the same class. The adopted discriminative classifier is the Fast Sparse Multinomial Re...

متن کامل

Penalized Estimation of Directed Acyclic Graphs From Discrete Data

The Bayesian network, with structure given by a directed acyclic graph (DAG), is a popular class of graphical models. However, learning Bayesian networks from discrete or categorical data is particularly challenging, due to the large parameter space and the difficulty in searching for a sparse structure. In this article, we develop a maximum penalized likelihood method to tackle this problem. I...

متن کامل

glmgraph: an R package for variable selection and predictive modeling of structured genomic data

UNLABELLED One central theme of modern high-throughput genomic data analysis is to identify relevant genomic features as well as build up a predictive model based on selected features for various tasks such as personalized medicine. Correlating the large number of 'omics' features with a certain phenotype is particularly challenging due to small sample size (n) and high dimensionality (p). To a...

متن کامل

A Safe Screening Rule for Sparse Logistic Regression

The `1-regularized logistic regression (or sparse logistic regression) is a widely used method for simultaneous classification and feature selection. Although many recent efforts have been devoted to its efficient implementation, its application to high dimensional data still poses significant challenges. In this paper, we present a fast and effective sparse logistic regression screening rule (...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1712.05510  شماره 

صفحات  -

تاریخ انتشار 2017